2D Z-string: A new spatial knowledge representation for image databases

نویسندگان

  • Anthony J. T. Lee
  • Han-Pang Chiu
چکیده

The knowledge structure called the 2D Cþ-string, proposed by Huang et al., to represent symbolic pictures allows a natural way to construct iconic indexes for images. According to the cutting mechanism of the 2D Cþ-string, an object may be partitioned into several subparts. The number of partitioned subparts is bounded to OðnÞ, where n is the number of objects in the image. Hence, the string length is also bounded to OðnÞ. In this paper, we propose a new spatial knowledge representation called the 2D Z-string. Since there are no cuttings between objects in the 2D Z-string, the integrity of objects is preserved and the string length is bounded to OðnÞ. Finally, some experiments are conducted to compare the performance of both approaches. 2003 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarity Retrieval by 2D C-Trees Matching in Image Databases

Logical features are abstract representations of images at various levels of detail. Some logical features such as spaThe image retrieval based on spatial content is an attracting task in many image database applications. The 2D strings protial-location and spatial-relation [18] may be synthesized vide a natural way of constructing spatial indexing for images from primitive features, whereas ot...

متن کامل

2D C-Tree Spatial Representation for Iconic Image

The 2D string approaches provide a natural way of constructing iconic indexing for images. The 2D C-string representation with an efficient cutting mechanism is more characteristic of spatial knowledge and efficient in the representation of iconic images. However, the computation of object ranks in a 2D C-string might make the inference of spatial reasoning somewhat complicated. This shortcomin...

متن کامل

Relative coordinates oriented symbolic string for spatial relationship retrieval

Issues involving efficient data storage and retrieval have become increasingly important in the design of image database systems. The two dimensional B-string, a kind of symbolic picture representation, has been utilized for both characterizing the spatial knowledge embedded in images and for describing images with either partially or completely overlapping objects, without the need to partitio...

متن کامل

Image Indexing and Similarity Retrieval Based on A New Spatial Relation Model

Spatial relation model is important technique fo r iniage indexing arid retrieval in iniage or niultiniedia databases. 2 0 strings and its variants are proposed to s~rpport the representation of spatial relationship. I n this paper, a new spatial knowledge representarion model rianied “Tvi.0 Diniension Begin-End boundan string”(2D BE-string) is proposed. The 2 0 BE-string represents on icon by ...

متن کامل

Design and evaluation of spatial similarity approaches for image retrieval

Similarity retrieval by spatial image content (i.e., using multiple objects and their relationships in space) is an open problem which has received considerable attention in the literature. The most powerful approaches of spatial image content representation and retrieval are “Attributed Relational Graphs” (ARGs) and “Symbolic Projections” (e.g., 2D Strings). In this work, a framework is propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2003